Erratum to: Inexact constraint preconditioners for linear systems arising in interior point methods
نویسندگان
چکیده
It was brought to our attention by Professor Valeria Simoncini that our proof of Theorem 2.1 [2, p. 139] is incorrect. Indeed, on page 140 we write the inequality (2.4) which is correct because we work with à which is an m× n matrix and m ≤ n and rank(A)=m hence ‖ÃT y‖ ‖y‖ ≥ σ̃1. However, on page 141 we write the inequality (2.6). We try to use a similar argument but now instead of à we have à and x ∈Rn. Hence the inequality ‖Ãx‖ ‖x‖ ≥ σ̃1 (which we use to prove inequality (2.6)) is incorrect. In this short note we restate Theorem 2.1 of [2] and give a new proof.
منابع مشابه
Updating Constraint Preconditioners for KKT Systems in Quadratic Programming Via Low-Rank Corrections
This work focuses on the iterative solution of sequences of KKT linear systems arising in interior point methods applied to large convex quadratic programming problems. This task is the computational core of the interior point procedure and an efficient preconditioning strategy is crucial for the efficiency of the overall method. Constraint preconditioners are very effective in this context; ne...
متن کاملInexact Jacobian Constraint Preconditioners in Optimization
In this paper we analyze a class of approximate constraint preconditioners in the acceleration of Krylov subspace methods fot the solution of reduced Newton systems arising in optimization with interior point methods. We propose a dynamic sparsification of the Jacobian matrix at every stage of the interior point method. Spectral analysis of the preconditioned matrix is performed and bounds on i...
متن کاملInexact constraint preconditioners for linear systems arising in interior point methods
Issues of indefinite preconditioning of reduced Newton systems arising in optimization with interior point methods are addressed in this paper. Constraint preconditioners have shown much promise in this context. However, there are situations in which an unfavorable sparsity pattern of Jacobian matrix may adversely affect the preconditioner and make its inverse representation unacceptably dense ...
متن کاملAugmentation Preconditioning for Saddle Point Systems Arising from Interior Point Methods
We investigate a preconditioning technique applied to the problem of solving linear systems arising from primal-dual interior point algorithms in linear and quadratic programming. The preconditioner has the attractive property of improved eigenvalue clustering with increased ill-conditioning of the (1, 1) block of the saddle point matrix. We demonstrate performance of the preconditioner on prob...
متن کاملAn inexact interior point method for L 1-regularized sparse covariance selection
Sparse covariance selection problems can be formulated as log-determinant (log-det ) semidefinite programming (SDP) problems with large numbers of linear constraints. Standard primal-dual interior-point methods that are based on solving the Schur complement equation would encounter severe computational bottlenecks if they are applied to solve these SDPs. In this paper, we consider a customized ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comp. Opt. and Appl.
دوره 49 شماره
صفحات -
تاریخ انتشار 2011